What to Ask to an Incomplete Semantic Web Reasoner?
نویسندگان
چکیده
Largely motivated by Semantic Web applications, many highly scalable, but incomplete, query answering systems have been recently developed. Evaluating the scalability-completeness trade-off exhibited by such systems is an important requirement for many applications. In this paper, we address the problem of formally comparing complete and incomplete systems given an ontology schema (or TBox) T . We formulate precise conditions on TBoxes T expressed in the EL, QL or RL pro le of OWL 2 under which an incomplete system is indistinguishable from a complete one w.r.t. T , regardless of the input query and data. Our results also allow us to quantify the degree of incompleteness of a given system w.r.t. T as well as to automatically identify concrete queries and data patterns for which the incomplete system will miss answers.
منابع مشابه
How Incomplete Is Your Semantic Web Reasoner?
Conjunctive query answering is a key reasoning service for many ontology-based applications. In order to improve scalability, many Semantic Web query answering systems give up completeness (i.e., they do not guarantee to return all query answers). It may be useful or even critical to the designers and users of such systems to understand how much and what kind of information is (potentially) bei...
متن کاملRepairing Ontologies for Incomplete Reasoners
The need for scalable query answering often forces Semantic Web applications to use incomplete OWL 2 reasoners, which in some cases fail to derive all answers to a query. This is clearly undesirable, and in some applications may even be unacceptable. To address this problem, we investigate the problem of ‘repairing’ an ontology T —that is, computing an ontology R such that a reasoner that is in...
متن کاملCompleteness Guarantees for Incomplete Ontology Reasoners: Theory and Practice
To achieve scalability of query answering, the developers of Semantic Web applications are often forced to use incomplete OWL 2 reasoners, which fail to derive all answers for at least one query, ontology, and data set. The lack of completeness guarantees, however, may be unacceptable for applications in areas such as health care and defence, where missing answers can adversely affect the appli...
متن کاملTowards the evaluation of the LarKC Reasoner Plug-ins
In this paper, we present an initial framework of evaluation and benchmarking of reasoners deployed within the LarKC platform, a platform for massive distributed incomplete reasoning that will remove the scalability barriers of currently existing reasoning systems for the Semantic Web. We discuss the evaluation methods, measures, benchmarks, and performance targets for the plug-ins to be develo...
متن کاملDeveloping an Incomplete Reasoner in Five Minutes: The Large Knowledge Collider in Action
The Large Knowledge Collider (LarKC) is a prominent development platform for the Semantic Web reasoning applications. Guided by the preliminary goal to facilitate the incomplete reasoning, LarKC has evolved in a unique platform, which can be used for the development of robust, flexible, and efficient semantic web applications, also leveraging the modern grid and cloud resources. As a reaction o...
متن کامل